package com.algorithm.dp;

/**
 * 爬楼梯最低成本
 *
 * @author Amadeus
 * @date 2023/10/20
 */
public class minCostClimbingStairs {

    public static int minCostClimbingStairs(int[] cost) {
        int n = cost.length;
        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = 0;
        for (int i = 2; i <= n; i++) {
            dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
        }
        return dp[n];
    }

    public static void main(String[] args) {
        int[] i = {10, 15, 20};
        System.out.println(minCostClimbingStairs(i));
    }

}
